https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11712 Wed 11 Apr 2018 12:05:04 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7781 0 and t ≥ 0 such that EDp+t(G) = EDt(G) [EDp+t(G) ≅ EDt(G)]. We derive that almost all digraphs have period two and tail zero. On the other hand, we show that there exist digraphs with arbitrarily large iso-period. We construct them using the generalized lexicographic product, taking as a basis an odd cycle graph. Additionally, we determine the period and tail of any tree, as well as other classes of graphs, by considering the connectivity of a certain subdigraph of ED(G) that 'concentrates' the eccentricities of all vertices of G.]]> Sat 24 Mar 2018 08:35:30 AEDT ]]>